On Separating Points by Lines
نویسندگان
چکیده
Given a set P of n points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate n points, picked randomly (and uniformly) in the unit square, is Θ̃(n), where Θ̃ hides polylogarithmic factors. In addition, we provide a fast approximation algorithm for computing the separability of a given point set in the plane. Finally, we point out the connection between separability and partitions.
منابع مشابه
Separability by two lines and by flat polygonals∗
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.
متن کاملA new approach for assessing stability of rock slopes considering centroids of weak zones
The intersection lines between discontinuity surfaces and their intersection points on the visible surfaces of any engineering structure may be the instability indicators. This paper describes a new approach to modelling the intersecting lines and points that would provide the first evaluation of any instability in an engineering structure characterized by the failure modes. In this work, the i...
متن کاملSeparability by two lines and by nearly straight polygonal chains
In this paper we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N logN)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0) logN)-time algorithm for computing a nearly-straight minimal Θ-polygonal chain separating...
متن کاملTowards the computation of the convex hull of a configuration from its corresponding separating matrix
In this paper, we cope with the following problem: compute the size of the convex hull of a configuration C, where the given data is the number of separating lines between any two points of the configuration (where the lines are generated by pairs of other points of the configuration). We give an algorithm for the case that the convex hull is of size 3, and a partial algorithm and some directio...
متن کامل3D Detection of Power-Transmission Lines in Point Clouds Using Random Forest Method
Inspection of power transmission lines using classic experts based methods suffers from disadvantages such as highel level of time and money consumption. Advent of UAVs and their application in aerial data gathering help to decrease the time and cost promenantly. The purpose of this research is to present an efficient automated method for inspection of power transmission lines based on point c...
متن کامل